Attacks on the Search RLWE Problem with Small Errors
نویسندگان
چکیده
منابع مشابه
Attacks on the Search-RLWE problem with small errors
The Ring Learning-With-Errors (RLWE) problem shows great promise for post-quantum cryptography and homomorphic encryption. We describe a new attack on the non-dual search RLWE problem with small error widths, using ring homomorphisms to finite fields and the chi-square statistical test. In particular, we identify a “subfield vulnerability” (Section 5.2) and give a new attack which finds this vu...
متن کاملAttacks on Search RLWE
We describe a new attack on the Search Ring Learning-With-Errors (RLWE) problem based on the chi-square statistical test, and give examples of RLWE instances in Galois number fields which are vulnerable to our attack. We prove a search-to-decision reduction for Galois fields which applies for any unramified prime modulus q, regardless of the residue degree f of q, and we use this in our attacks...
متن کاملVulnerable Galois RLWE Families and Improved Attacks
Lattice-based cryptography was introduced in the mid 1990s in two different forms, independently by Ajtai-Dwork [AD97] and Hoffstein-Pipher-Silverman [HPSS08]. Thanks to the work of Stehlé-Steinfeld [SS11], we now understand the NTRU cryptosystem introduced by Hoffstein-Pipher-Silverman to be a variant of a cryptosystem which has security reductions to the Ring Learning With Errors (RLWE) probl...
متن کاملthe effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولSearch Parameters for the Small World Problem
In "small world" studies successive men each send on a postcard packet to an acquaintance who may know a designated target person on a first-name basis. In this analysis the likelihood of discarding the packet is separated from the chance the packet if sent reaches a man who knows the target. The former probability is assumed to be independent of the previous number of persons in the chain. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Algebra and Geometry
سال: 2017
ISSN: 2470-6566
DOI: 10.1137/16m1096566